Finite Markov Chains and the Top-to-random Shuffle
نویسنده
چکیده
In this paper, I present an introduction to Markov chains, basic tools to analyze them, and an example, the top-to-random shuffle. I cover the existence and uniqueness of stationary distributions, the Convergence Theorem, total variation distance, mixing time, and strong stationary times. Using these tools, I show that the top-to-random shuffle on a deck of n cards mixes the deck in approximately n log n shuffles.
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملMarkov Chains : Graph Connectivity , Satisfiability , Rapid Mixing , Gambler ’ s Ruin , Move - To - Front
We will apply our knowledge about random walks to the connectivity problem in graphs and to the satisfiability problem. We will see a connectivity algorithm that works in logarithmic space and a satisfiability algorithm that runs in expected time Õ((4/3)n) and hence is much faster than the naive 2n algorithm that tries all possible assignments. In the second part, we ask how fast a chain conver...
متن کاملThe University of Chicago Robust Mixing a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science by Murali Krishnan Ganapathy
How many times should a card shuffler shuffle to get the cards shuffled? Convergence rate questions like these are central to the theory of finite Markov Chains and arise in diverse fields including Physics, Computer Science as well as Biology. This thesis introduces two new approaches to estimating mixing times: robust mixing time of a Markov Chain and Markovian product of Markov Chains. The “...
متن کاملThe University of Chicago Robust Mixing a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science by Murali Krishnan Ganapathy
How many times should a card shuffler shuffle to get the cards shuffled? Convergence rate questions like these are central to the theory of finite Markov Chains and arise in diverse fields including Physics, Computer Science as well as Biology. This thesis introduces two new approaches to estimating mixing times: robust mixing time of a Markov Chain and Markovian product of Markov Chains. The “...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013